GARM: A stochastic evolution based genetic algorithm with rewarding mechanism for wind farm layout optimization

Wind energy has emerged as a potential alternative to traditional energy sources for economical and clean power generation. One important aspect of wind energy generation is the layout design of the wind farm so as to harness maximum energy. Due to its inherent computational complexity, the wind farm layout design problem has traditionally been solved using nature-inspired algorithms. An important issue in nature-inspired algorithms is the termination condition, which governs the execution time of the algorithm. To optimize the execution time, appropriate termination conditions should be employed. This study proposes the concept of a rewarding mechanism to achieve optimization in termination conditions while maintaining the solution quality. The proposed rewarding mechanism, adopted from the stochastic evolution algorithm, is incorporated into a genetic algorithm. The proposed genetic algorithm with the rewarding mechanism (GARM) is empirically tested using real data from a potential wind farm site with different rewarding iterations

Design of Packet-Based Block Codes with Shift Operators

This paper introduces packet-oriented block codes for the recovery of lost packets and the correction of an erroneous single packet. Specifically, a family of systematic codes is proposed, based on a Vandermonde matrix applied to a group of information packets to construct redundant packets, where the elements of the Vandermonde matrix are bit-level right arithmetic shift operators. The code design is applicable to packets of any size, provided that the packets within a block of information packets are of uniform length. In order to decrease the overhead associated with packet padding using shift operators, non-Vandermonde matrices are also proposed for designing packet-oriented block codes. An efficient matrix inversion procedure for the off-line design of the decoding algorithm is presented to recover lost packets. The error correction capability of the design is investigated as well. The decoding algorithm, based on syndrome decoding, to correct a single erroneous packet in a group of received packets is presented. The paper is equipped with examples of codes using different parameters. The code designs and their performance are tested using Monte Carlo simulations; the results obtained exhibit good agreement with the corresponding theoretical results.</p

Design of Packet-Based Block Codes with Shift Operators

This paper introduces packet-oriented block codes for the recovery of lost packets and the correction of an erroneous single packet. Specifically, a family of systematic codes is proposed, based on a Vandermonde matrix applied to a group of k information packets to construct r redundant packets, where the elements of the Vandermonde matrix are bit-level right arithmetic shift operators. The code design is applicable to packets of any size, provided that the packets within a block of k information packets are of uniform length. In order to decrease the overhead associated with packet padding using shift operators, non-Vandermonde matrices are also proposed for designing packet-oriented block codes. An efficient matrix inversion procedure for the off-line design of the decoding algorithm is presented to recover lost packets. The error correction capability of the design is investigated as well. The decoding algorithm, based on syndrome decoding, to correct a single erroneous packet in a group of n=k+r received packets is presented. The paper is equipped with examples of codes using different parameters. The code designs and their performance are tested using Monte Carlo simulations; the results obtained exhibit good agreement with the corresponding theoretical results